Finding Maximal 2-Dimensional Palindromes

This paper extends the problem of palindrome searching into a higher dimension, addressing two definitions of 2D palindromes. The first definition implies a square, while the second definition (also known as a centrosymmetric factor), can be any rectangular shape. We describe two algorithms for searching a 2D text for maximal palindromes, one for each type of 2D palindrome. The first algorithm is optimal; it runs in linear time, on par with Manacher\u27s linear time 1D palindrome algorithm. The second algorithm searches a text of size n_1 x n_2 (n_1 >= n_2) in O(n_2) time for each of its n_1 x n_2 positions. Since each position may have up to O(n_2) maximal palindromes centered at that location, the second result is also optimal in terms of the worst-case output size

TRedD—A database for tandem repeats over the edit distance

A ‘tandem repeat’ in DNA is a sequence of two or more contiguous, approximate copies of a pattern of nucleotides. Tandem repeats are common in the genomes of both eukaryotic and prokaryotic organisms. They are significant markers for human identity testing, disease diagnosis, sequence homology and population studies. In this article, we describe a new database, TRedD, which contains the tandem repeats found in the human genome. The database is publicly available online, and the software for locating the repeats is also freely available. The definition of tandem repeats used by TRedD is a new and innovative definition based upon the concept of ‘evolutive tandem repeats’. In addition, we have developed a tool, called TandemGraph, to graphically depict the repeats occurring in a sequence. This tool can be coupled with any repeat finding software, and it should greatly facilitate analysis of results. Database URL: http://tandem.sci.brooklyn.cuny.edu

Two-Dimensional Maximal Repetitions

Maximal repetitions or runs in strings have a wide array of applications and thus have been extensively studied. In this paper, we extend this notion to 2-dimensions, precisely defining a maximal 2D repetition. We provide initial bounds on the number of maximal 2D repetitions that can occur in a matrix. The main contribution of this paper is the presentation of the first algorithm for locating all maximal 2D repetitions in a matrix. The algorithm is efficient and straightforward, with runtime O(n^2 log n log log n+ rho log n), where n^2 is the size of the input, and rho is the number of 2D repetitions in the output

Double String Tandem Repeats

A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all tandem repeats in a double string. The problem introduced here has applications beyond actual double strings, as we illustrate by solving two different problems with the algorithm of the double string tandem repeats problem. The first problem is that of finding all corner-sharing tandems in a 2-dimensional text, defined by Apostolico and Brimkov. The second problem is that of finding all scaled tandem repeats in a 1d text, where a scaled tandem repeat is defined as a string UU\u27 such that U\u27 is discrete scale of U. In addition to the algorithms for exact tandem repeats, we also present algorithms that solve the problem in the inexact sense, allowing up to k mismatches. We believe that this framework will open a new perspective for other problems in the future

SARS-CoV-2 vaccines and donor recruitment for FMT

Non peer reviewe

International consensus conference on stool banking for faecal microbiota transplantation in clinical practice

Although faecal microbiota transplantation (FMT) has a well-established role in the treatment of recurrent Clostridioides difficile infection (CDI), its widespread dissemination is limited by several obstacles, including lack of dedicated centres, difficulties with donor recruitment and complexities related to regulation and safety monitoring. Given the considerable burden of CDI on global healthcare systems, FMT should be widely available to most centres. Stool banks may guarantee reliable, timely and equitable access to FMT for patients and a traceable workflow that ensures safety and quality of procedures. In this consensus project, FMT experts from Europe, North America and Australia gathered and released statements on the following issues related to the stool banking: general principles, objectives and organisation of the stool bank; selection and screening of donors; collection, preparation and storage of faeces; services and clients; registries, monitoring of outcomes and ethical issues; and the evolving role of FMT in clinical practice, Consensus on each statement was achieved through a Delphi process and then in a plenary face-to-face meeting. For each key issue, the best available evidence was assessed, with the aim of providing guidance for the development of stool banks in order to promote accessibility to FMT in clinical practice.Peer reviewe